1466C - Canine poetry - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define DIVYA                         \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define ll long long
#define cy cout << "YES\n"
#define cn cout << "NO\n"
typedef vector<ll> vll;
#define pb push_back
#define inf 1000000000000000005
const ll mod = 1e9 + 7;
ll inv(ll i)
{
    if (i == 1)
        return 1;
    return (mod - ((mod / i) * inv(mod % i)) % mod) % mod;
}
ll mod_mul(ll a, ll b)
{
    a = a % mod;
    b = b % mod;
    return (((a * b) % mod) + mod) % mod;
}
ll mod_add(ll a, ll b)
{
    a = a % mod;
    b = b % mod;
    return (((a + b) % mod) + mod) % mod;
}
ll ceil_div(ll a, ll b) { return a % b == 0 ? a / b : a / b + 1; }
ll bin_expo(int a, int b, int m)
{
    int res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = (res * a) % m;
        a = (a * a) % m;
        b = b >> 1;
    }
    return res;
}
ll mod_inv(int a, int b) { return bin_expo(a, b - 2, b); }
//****************************Template Ends*******************************//

int main()
{
    DIVYA;
    ll t, n,m, i, j, ans,temp, sum,pos = 0,check = 1,x,y,cnt = 0;
    string s;
    t = 1;
    cin >> t;
    while (t--)
    {
         ans = temp = sum = 0;
         cin >> s;
         n = s.size();
         for(int i = 0; i < n; i++)
         {
             if(s[i] == s[i+1] and s[i] != '#' and i + 1 < n)
             {
                 ans++;
                 s[i+1] = '#';
             }
             if(s[i+2] == s[i] and s[i] != '#' and i + 2 < n)
             {
                 ans++;
                 s[i+2] = '#';
             }
         }
         cout << ans << "\n";
         
    }
    return 0;
}